A Composition Theorem for Universal One-Way Hash Functions
نویسنده
چکیده
In this paper we present a new scheme for constructing universal one-way hash functions that hash arbitrarily long messages out of universal one-way hash functions that hash fixed-length messages. The new construction is extremely simple and is also very efficient, yielding shorter keys than previously proposed composition constructions.
منابع مشابه
Hash Functions: From Merkle-Damgård to Shoup
In this paper we study two possible approaches to improving existing schemes for constructing hash functions that hash arbitrary long messages. First, we introduce a continuum of function classes that lie between universal one-way hash functions and collision-resistant functions. For some of these classes efficient (yielding short keys) composite schemes exist. Second, we prove that the schedul...
متن کاملA Cookbook for Black-Box Separations and a Recipe for UOWHFs
We present a new framework for proving fully black-box separations and lower bounds. We prove a general theorem that facilitates the proofs of fully black-box lower bounds from a one-way function (OWF). Loosely speaking, our theorem says that in order to prove that a fully black-box construction does not securely construct a cryptographic primitive Q (e.g., a pseudo-random generator or a univer...
متن کاملDomain Extension for Enhanced Target Collision-Resistant Hash Functions
We answer the question of Reyhanitabar et al. from FSE’09 of constructing a domain extension scheme for enhanced target collisionresistant (eTCR) hash functions with sublinear key expansion. The eTCR property, introduced by Halevi and Krawczyk [1], is a natural fit for hashand-sign signature schemes, offering an attractive alternative to collisionresistant hash functions. We prove a new composi...
متن کاملA Primitive for Proving the Security of Every Bit andAbout Universal Hash Functions & Hard CorePredicates ?
In 1999, J. H astad and M. NN aslund 13] could prove that every bit is a hard core of the RSA function. From this work we extract an abstract theorem about the hidden number problem which can be used to prove that every bit is a hard core of many speciic cryptographic functions. Applications are RSA, ElGamal, Rabin, a modiied Diie-Hellman function, Pailler's cryptosystem, the Diie-Hellman funct...
متن کاملOn Constructing Universal One-Way Hash Functions from Arbitrary One-Way Functions
A fundamental result in cryptography is that a digital signature scheme can be constructed from an arbitrary one-way function. A proof of this somewhat surprising statement follows from two results: first, Naor and Yung defined the notion of universal one-way hash functions and showed that the existence of such hash functions implies the existence of secure digital signature schemes. Subsequent...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IACR Cryptology ePrint Archive
دوره 1999 شماره
صفحات -
تاریخ انتشار 1999